An Adaptive Algorithm to Compute the Medial Axis Transform of 2-D Polygonal Domains
نویسندگان
چکیده
An adaptive algorithm to compute the medial axis transform of 2D polygonal domains with arbitrary genus is presented. The algorithm is based in the reenement of a coarse medial axis transform by subdividing the domain adaptively. The algorithm provides the medial axis represented by a set of triangles of a predeened size and the closest boundary element. Examples of results are also presented to illustrate the method. Partially supported by a CIRIT fellowship of the Government of Catalonia under grant 1995BEAI400071.
منابع مشابه
Polygonal Approximation of Voronoi Diagrams of a Set of Triangles in Three Dimensions
We describe a robust adaptive marching tetrahedra type algorithm for constructing a polygonal approximation of the Voronoi Diagram of an arbitrary set of triangles in three dimensions. Space is adaptively subdivided into a set of tetrahedral cells, and the set of Voronoi regions which intersect each cell is determined exactly using a simple primitive we introduce. We obtain a small number of di...
متن کاملDistance functions and skeletal representations of rigid and non-rigid planar shapes
Shape skeletons are fundamental concepts for describing the shape of geometric objects, and have found a variety of applications in a number of areas where geometry plays an important role. Two types of skeletons commonly used in geometric computations are the straight skeleton of a (linear) polygon, and the medial axis of a bounded set of points in the k-dimensional Euclidean space. However, e...
متن کاملAdaptive Curvature-Sensitive Meshing of the Medial Axis
The medial axis transform provides an alternative r epresentation of geometric models that has many use ful properties for analysis modelling. Applications include decomposition of ge neral solids into sub regions for mapped meshing, i dentification of slender regions for dimensional reduction and recognition o f small features for suppression. In order to serve these purposes effectively, it i...
متن کاملAccurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky et al. [1]. While the original algorithm is able to compute geodesic distances to isolated points on the mesh only, our generalization can handle arbitrary, possibly open, polygons on the mesh to define the zero set of th...
متن کاملGMAT: The Groupwise Medial Axis Transform for Fuzzy Skeletonization and Intelligent Pruning
There is a frequent need to compute medial shape representations of each of a group of structures, e.g. for use in a medical study of anatomical shapes. We present a novel approach to skeletonization that leverages information provided from such a group. We augment the traditional medial axis transform with an additional coordinate stored at each medial locus, indicating the confidence that the...
متن کامل